Improved embedding efficiency and AWGN robustness for SS watermarks via pre-coding

نویسندگان

  • Oktay Altun
  • Orhan Bulan
  • Gaurav Sharma
  • Mark F. Bocko
چکیده

Spread spectrum (SS) modulation is utilized in many watermarking applications because it offers exceptional robustness against several attacks. The embedding rate-distortion performance of SS embedding however, is relatively weak compared to quantization index modulation (QIM). This limits the relative embedding rate of SS watermarks. In this paper, we illustrate that both the embedding efficiency, i.e. bits embedded per unit distortion and robustness against additive white gaussian noise (AWGN) can be improved by pre-coding of message followed by constellation adjustment on the SS detector to minimize the distortion on the cover image introduced by coded data. Our pre-coding method encodes p bits as a 2 × 1 binary vector with a single nonzero entry whose index indicates the value of the embedded bits. Our analysis show that the method improves embedding rate by approximately p/4 without increasing embedding distortion or sacrificing robustness to AWGN attacks. Experimental evaluation of the method using a set theoretic embedding framework for the watermark insertion validates our analysis.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Insertion, deletion robust audio watermarking: a set theoretic, dynamic programming approach

Desynchronization vulnerabilities have limited audio watermarking’s success in applications such as digital rights management (DRM). Our work extends (blind-detection) spread spectrum (SS) watermarking to withstand time scale desynchronization (insertion/deletions) by applying dynamic programming (DP). Detection uses short SS watermark blocks with a novel O(N logN) correlation algorithm that pr...

متن کامل

Embedding and Detecting Spread Spectrum Watermarks under The Estimation Attack

Spread-spectrum (SS) watermarking has been one of the oldest methodologies for hiding data in multimedia signals. Recently, it has been demonstrated that simple block repetition codes enable strong robustness of such watermarks with respect to noise addition and limited arbitrary geometric transformations. In order to further investigate the security of such watermarks, in this manuscript, we e...

متن کامل

A Channel Model for a Watermark Attack

Digital watermarking of multimedia (e.g., audio, images, video, etc.) can be viewed as a communications problem in which the watermark must be transmitted and received through a \watermark channel." The watermark channel includes distortions resulting from attacks and may include interference from the original digital data. Most current techniques for embedding digital watermarks in multimedia ...

متن کامل

An Improved Phase Coding-Based Watermarking Algorithm for Speech Perceptual Hashing Authentication

Speech perceptual hashing authentication provides an efficient way for security authentication of speech content. To solve the problem of perceptual hash value efficient and secure transmission, we present a speech watermarking algorithm, which is based on improved phase coding by bipolar quantization and suitable for speech perceptual hashing authentication. This algorithm embeds the perceptua...

متن کامل

The Game of Embedding and Detecting Spread Spectrum Watermarks under The Estimation Attack

Recently, we have demonstrated that simple block repetition codes enable strong robustness of spread-spectrum (SS) watermarks (WMs) with respect to limited geometric transformations [1]. Although such codes provide an effective prevention mechanism against WM de-synchronization, they also significantly increase the effectiveness of the watermark estimation attack [2]. We show the theory behind ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008